Generalized Hyper-Systolic Algorithm
نویسنده
چکیده
We generalize the hyper-systolic algorithm proposed in [1] for abstract data structures on massive parallel computers with np processors. For a problem of size V the communication complexity of the hyper-systolic algorithm is proportional to √ npV , to be compared with npV for the systolic case. The implementation technique is explained in detail and the example of the parallel matrix-matrix multiplication is tested on the Cray-T3D. e-mail: [email protected]
منابع مشابه
Hyper-Systolic Matrix Multiplication
A novel parallel algorithm for matrix multiplication is presented. The hyper-systolic algorithm makes use of a one-dimensional processor abstraction. The procedure can be implemented on all types of parallel systems. It can handle matrix-vector multiplications as well as transposed matrix products.
متن کاملSystolic and Hyper-Systolic Algorithms for the Gravitational N-Body Problem, with an Application to Brownian Motion
A systolic algorithm rhythmically computes and passes data through a network of processors. We investigate the performance of systolic algorithms for implementing the gravitational N -body problem on distributedmemory computers. Systolic algorithms minimize memory requirements by distributing the particles between processors. We show that the performance of systolic routines can be greatly enha...
متن کاملA comparative study on scapular static position between femaleswith and without generalized joint hyper mobility
Background: Generalized joint hyper mobility predisposes some individuals to a wide variety of musculoskeletal complaints. Given the critical role of scapular position in function of shoulder, the aim of this study was to compare scapular position between persons with and without general joint hyper mobility. Methods: By nonprobability sampling 30 hyper mobile persons at average of 22.86 ±2.77...
متن کاملHyper-systolic algorithms for N-body computations and parallel level-3 BLAS libraries
Hyper-systolic algorithms repesent a new class of parallel computing structures. Because of their regular communication and compute patterns they are well suited for implementation on most parallel architectures, in particular, high performance SIMD machines can beneet considerably. After a short explanation of the concept of hyper-systolic algorithms, their application to N-body computations a...
متن کاملAlgorithm for Fuzzy Maximum Flow Problem in Hyper-Network Setting
Maximum flow problem on hypergraphs (hyper-networks) is an extension of maximum flow problem on normal graphs. In this paper, we consider a generalized fuzzy version of maximum flow problem in hyper-networks setting. Our algorithm is a class of genetic algorithms and based on genetic tricks. The crisp equivalents of fuzzy chance constraints in hyper-networks setting are defined, and the executi...
متن کامل